A Mathematical Study on “Additive Technique” Versus “Branch and Bound Technique” for Solving Binary Programming Problem

A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem

Branch-and-Bound Technique for Solving Optimal Clustering

The problem of finding optimal clustering has not been well covered in literature. Solutions can be found only for special cases, which can be solved in polynomial time. In this paper, we give solution for the general case. The method generates all possible clusterings by a series of merge steps. The clusterings are organized as a minimum redundancy search tree and the optimal clustering is fou...

An Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem

One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...

Modified Gauss Elimination Technique for Separable Nonlinear Programming Problem

A modified branch and bound algorithm for a vague flow-shop scheduling problem

Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...